An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages

نویسندگان

Andrei Paun

Nicolae Santean

Sheng Yu

چکیده

Cover automata were introduced in [1] as an efficient representation of finite languages. In [1], an algorithm was given to transform a DFA that accepts a finite language to a minimal deterministic finite cover automaton (DFCA) with the time complexity O(n), where n is the number of states of the given DFA. In this paper, we introduce a new efficient transformation algorithm with the time complexity O(n), which is a significant improvement from the previous algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Minimality of Finite Automata and Stream X-machines for Finite Languages

A cover automaton of a finite language L is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L. An algorithm for constructing a minimal cover automaton of a finite language L is given in a recent paper. This paper goes a step further by proposing a procedure for constructing all minimal cover automata of a given finite language L. The conc...

متن کامل

Minimal Cover-Automata for Finite Languages

A cover-automaton A of a finite language L ⊆ Σ∗ is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic cover automaton of a finite language L usually has a smaller size than a minimal DFA that accept L. Thus, cover automata can be used to reduce the size of the representations of finite languages in practice. In thi...

متن کامل

A Time And Space Efficient Algorithm For Minimizing Cover Automata For Finite Languages

A deterministic finite automaton (DFA) A is called a cover automaton (DFCA) for a finite language L over some alphabet Σ if L = L(A) ∩ Σ≤l, with l being the length of some longest word in L. Thus a word w ∈ Σ∗ is in L if and only if |w| ≤ l and w ∈ L(A). The DFCA A is minimal if no DFCA for L has fewer states. In this paper, we present an algorithm which converts an n–state DFA for some finite ...

متن کامل

Determining the equivalence for 1 - way quantum finite automata ∗

Two quantum finite automata are equivalent if for any input string x the two automata accept x with equal probability. In this paper, we focus on determining the equivalence for 1-way quantum finite automata with control language (CL-1QFAs) defined by Bertoni et al and measure-many 1-way quantum finite automata (MM-1QFAs) introduced by Kondacs and Watrous. It is worth pointing out that although...

متن کامل